Representing Roots on the Basis of Reeb Graphs in Plant Phenotyping
نویسندگان
چکیده
This paper presents a new representation for root images based on Reeb graphs. The representation proposed captures lengths and distances in root structures as well as locations of branches, numbers of lateral roots and the locations of the root tips. An analysis of root images using Reeb graphs is presented and results are compared to ground truth measurements. This paper shows, that the Reeb graph based approach not only captures the characteristics needed for phenotyping of plants, but it also provides a solution to the problem of overlapping roots in the images. Using a Reeb graph based representation, such overlaps can be directly detected without further analysis, during the computation of the graph.
منابع مشابه
Reeb graph based examination of root development
This paper presents an approach to analyze plant root development by means of topological image analysis. For phenotyping of plants their root development, the architecture of their root systems and thereby root characteristics such as branches and branch endings are analyzed. In order to simplify the examination of root characteristics and enable an efficient comparison of roots, a representat...
متن کاملTR Examination of root development by means of topological image analysis
The focus of this work is to examine root plant development by means of topological image analysis. As roots grow and develop they change their shape (for example when branches are formed). Due to this aspect this application is well suited for a topological analysis. The aim of the scientific practical is to represent the root images as Reeb graphs. A method to compute critical points using a ...
متن کاملReeb Graphs Through Local Binary Patterns
This paper presents an approach to derive critical points of a shape, the basis of a Reeb graph, using a combination of a medial axis skeleton and features along this skeleton. A Reeb graph captures the topology of a shape. The nodes in the graph represent critical points (positions of change in the topology), while edges represent topological persistence. We present an approach to compute such...
متن کاملEfficient algorithms for computing Reeb graphs
The Reeb graph tracks topology changes in level sets of a scalar function and finds applications in scientific visualization and geometric modeling. We describe an algorithm that constructs the Reeb graph of a Morse function defined on a 3-manifold. Our algorithm maintains connected components of the two dimensional levels sets as a dynamic graph and constructs the Reeb graph in O(n log n+n log...
متن کاملStability of Reeb graphs under function perturbations: the case of closed curves
Reeb graphs provide a method for studying the shape of a manifold by encoding the evolution and arrangement of level sets of a simple Morse function defined on the manifold. Since their introduction in computer graphics they have been gaining popularity as an effective tool for shape analysis and matching. In this context one question deserving attention is whether Reeb graphs are robust agains...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2014